Mathematics and Algorithms for Computer Algebra
ثبت نشده
چکیده
The notes this week are based on several chapters of the very nice book by Lipson, which now unfortunately appears to be out of print. The first two sections of these notes provide a rapid summary of some of the basic notions of pure mathematics, as a reminder and in order to fix the notation and nomenclature that I will use. Subsequent sections summarize the properties of the computational domains of main interest for computer algebra. We will return in subsequent weeks to consider in more concrete detail several of the topics introduced this week.
منابع مشابه
Efficient Approximation Algorithms for Point-set Diameter in Higher Dimensions
We study the problem of computing the diameter of a set of $n$ points in $d$-dimensional Euclidean space for a fixed dimension $d$, and propose a new $(1+varepsilon)$-approximation algorithm with $O(n+ 1/varepsilon^{d-1})$ time and $O(n)$ space, where $0 < varepsilonleqslant 1$. We also show that the proposed algorithm can be modified to a $(1+O(varepsilon))$-approximation algorithm with $O(n+...
متن کاملSolving random inverse heat conduction problems using PSO and genetic algorithms
The main purpose of this paper is to solve an inverse random differential equation problem using evolutionary algorithms. Particle Swarm Algorithm and Genetic Algorithm are two algorithms that are used in this paper. In this paper, we solve the inverse problem by solving the inverse random differential equation using Crank-Nicholson's method. Then, using the particle swarm optimization algorith...
متن کاملPrimitive Ideal Space of Ultragraph $C^*$-algebras
In this paper, we describe the primitive ideal space of the $C^*$-algebra $C^*(mathcal G)$ associated to the ultragraph $mathcal{G}$. We investigate the structure of the closed ideals of the quotient ultragraph $ C^* $-algebra $C^*left(mathcal G/(H,S)right)$ which contain no nonzero set projections and then we characterize all non gauge-invariant primitive ideals. Our results generalize the ...
متن کاملMinimal solution of fuzzy neutrosophic soft matrix
The aim of this article is to study the concept of unique solvability of max-min fuzzy neutrosophic soft matrix equation and strong regularity of fuzzy neutrosophic soft matrices over Fuzzy Neutrosophic Soft Algebra (FNSA). A Fuzzy Neutrosophic Soft Matrix (FNSM) is said to have Strong, Linear Independent (SLI) column (or, in the case of fuzzy neutrosophic soft square matrices, to be strongly r...
متن کاملExtended Fuzzy $BCK$-subalgebras
This paper extends the notion of fuzzy $BCK$-subalgebras to fuzzy hyper $BCK$-subalgebras and defines an extended fuzzy $BCK$-subalgebras. This study considers a type of fuzzy hyper $BCK$-ideals in this hyperstructure and describes the relationship between hyper $BCK$-ideals and fuzzy hyper $BCK$-ideals. In fact, it tries to introduce a strongly regular relation on hyper $...
متن کاملNew Algorithm For Computing Secondary Invariants of Invariant Rings of Monomial Groups
In this paper, a new algorithm for computing secondary invariants of invariant rings of monomial groups is presented. The main idea is to compute simultaneously a truncated SAGBI-G basis and the standard invariants of the ideal generated by the set of primary invariants. The advantage of the presented algorithm lies in the fact that it is well-suited to complexity analysis and very easy to i...
متن کامل